A Modified Dirty Paper Trellis Codes for Digital Watermarking
نویسندگان
چکیده
Watermark algorithm relies on informed coding which is the scheme of representing of watermark message with patterns that dependents on the host. It offers a large number of alternative vectors to represent the same message. And the feature is trade-off between the robustness and fidelity. The paper describes a modified trellis to embed our data, instead of complex trellis, to reduce the computational time to find the vector among the alternative vectors appropriate to the host. Keywords— Informed coding, robustness, watermarking.
منابع مشابه
Trellis coded modulation to improve dirty paper trellis watermarking
Lattice codes and quantization-based techniques have received considerable attention as a method of digital watermarking with side information. However, these algorithms are also recognized to be highly sensitive to common signal processing primitives such as valuemetric scaling, e.g. changes in volume of a song, or re-quantization, e.g. JPEG compression. Hence, it is reasonable to investigate ...
متن کاملA novel embedding technique for dirty paper trellis codes watermarking
→ Security weakness (Kerckhoffs's framework). Code book estimable on a simplified version [2]. → High computational complexity of the Embedding part Lin et al. [3] solution is not enough satisfying in term of robustness-distortion tradeoff. → DCT artifacts. [1] “Applying Informed Coding and Informed Embedding to Design a Robust, High Capacity Watermark”, Miller, Doërr, and Cox, IEEE TIP 2004. [...
متن کاملDirty-paper trellis codes for watermarking
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each message is represented by a large number of alternative vectors. Most previous dirty-paper codes are based on lattice codes, in which each code vector, or pattern, is a point in a regular lattice. While such codes are ...
متن کاملFast Embedding Technique for Dirty Paper Trellis Watermarking
This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate watermarking schemes. Nevertheless, recent researches reveal its security weakness. Previously, we proposed to reinforce its security by using a secret space before the embedding. This secret space requires to compute...
متن کاملJoint Data Hiding and Wyner-Ziv Coding, Theory and Practice
This paper considers the joint problem of dirty-paper and Wyner-Ziv coding with partial host information at the receiver. The rate-distortion and the capacity expressions have been derived for the Gaussian case. It is shown that the availability of the partial host information to the receiver has positive effects to the compression performance and the overall capacity. Moreover, a practical cod...
متن کامل